Improving Delete Relaxation Heuristics Through Explicitly Represented Conjunctions
نویسندگان
چکیده
منابع مشابه
Improving Delete Relaxation Heuristics Through Explicitly Represented Conjunctions
Heuristic functions based on the delete relaxation compute upper and lower bounds on the optimal delete-relaxation heuristic h, and are of paramount importance in both optimal and satisficing planning. Here we introduce a principled and flexible technique for improving h, by augmenting delete-relaxed planning tasks with a limited amount of delete information. This is done by introducing special...
متن کاملRanking Conjunctions for Partial Delete Relaxation Heuristics in Planning
Heuristic search is one of the most successful approaches to classical planning, finding solution paths in large state spaces. A major focus has been the development of domainindependent heuristic functions. One recent method are partial delete relaxation heuristics, improving over the standard delete relaxation heuristic through imposing a set C of conjunctions to be treated as atomic. Practic...
متن کاملTrees of Shortest Paths vs. Steiner Trees: Understanding and Improving Delete Relaxation Heuristics
Heuristic search using heuristics extracted from the delete relaxation is one of the most effective methods in planning. Since finding the optimal solution of the delete relaxation is intractable, various heuristics introduce independence assumptions, the implications of which are not yet fully understood. Here we use concepts from graph theory to show that in problems with unary action precond...
متن کاملLifting Delete Relaxation Heuristics To Successor Generator Planning
The problem of deterministic planning, i.e., of finding a sequence of actions leading from a given initial state to a goal, is one of the most basic and well studied problems in artificial intelligence. Two of the best known approaches to deterministic planning are the black box approach, in which a programmer implements a successor generator, and the modelbased approach, in which a user descri...
متن کاملExecuting explicitly represented protocols
This paper describes an approach that enables agents to execute any interaction protocol that can be expressed in the proposed XML representation. Therefore, agents will be capable of executing any protocol representation received in run-time. In our approach, explicitly represented protocols are converted in an agent internal structure more suitable for being processed than XML. The internal r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2014
ISSN: 1076-9757
DOI: 10.1613/jair.4277